17 research outputs found
Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains
Concrete domains have been introduced in the area of Description Logic (DL) to enable reference to concrete objects (such as numbers) and predefined predicates on these objects (such as numerical comparisons) when defining concepts. Unfortunately, in the presence of general concept inclusions (GCIs), which are supported by all modern DL systems, adding concrete domains may easily lead to undecidability.
To regain decidability of the DL ALC in the presence of GCIs, quite strong restrictions, called ω-admissibility, were imposed on the concrete domain. On the one hand, we generalize the notion of ω-admissibility from concrete domains with only binary predicates to concrete domains with predicates of arbitrary arity. On the other hand, we relate ω-admissibility to well-known notions from model theory. In particular, we show that finitely bounded homogeneous structures yield ω-admissible concrete domains. This allows us to show ω-admissibility of concrete domains using existing results from model theory.
When integrating concrete domains into lightweight DLs of the EL family, achieving decidability of reasoning is not enough. One wants the resulting DL to be tractable. This can be achieved by using so-called p-admissible concrete domains and restricting the interaction between the DL and the concrete domain. We investigate p-admissibility from an algebraic point of view. Again, this yields strong algebraic tools for demonstrating p-admissibility. In particular, we obtain an expressive numerical p-admissible concrete domain based on the rational numbers. Although ω-admissibility and p-admissibility are orthogonal conditions that are almost exclusive, our algebraic characterizations of these two properties allow us to locate an infinite class of p-admissible concrete domains whose integration into ALC yields
decidable DLs.
DL systems that can handle concrete domains allow their users to employ a fixed set of predicates of one or more fixed concrete domains when modelling concepts.
They do not provide their users with means for defining new predicates, let alone new concrete domains. The good news is that finitely bounded homogeneous structures offer precisely that. We show that integrating concrete domains based on finitely bounded homogeneous structures into ALC yields decidable DLs even if we allow predicates specified by first-order formulas. This class of structures also provides effective means for defining new ω-admissible concrete domains with at most binary predicates. The bad news is that defining ω-admissible concrete domains with predicates of higher arities is computationally hard. We obtain two new lower bounds for this meta-problem, but leave its decidability open. In contrast, we prove that there is no algorithm that would facilitate defining p-admissible concrete domains already for binary signatures.:1. Introduction . . . 1
2. Preliminaries . . . 5
3. Description Logics with Concrete Domains . . . 9
3.1. Basic definitions and undecidability results . . . 9
3.2. Decidable and tractable DLs with concrete domains . . . 16
4. A Model-Theoretic Analysis of ω-Admissibility . . . 23
4.1. Homomorphism ω-compactness via ω-categoricity . . . 23
4.2. Patchworks via homogeneity . . . 24
4.3. JDJEPD via decomposition into orbits . . . 27
4.4. Upper bounds via finite boundedness . . . 28
4.5. ω-admissible finitely bounded homogeneous structures . . . 32
4.6. ω-admissible homogeneous cores with a decidable CSP . . . 34
4.7. Coverage of the developed sufficient conditions . . . 36
4.8. Closure properties: homogeneity & finite boundedness . . . 39
5. A Model-Theoretic Analysis of p-Admissibility . . . 47
5.1. Convexity via square embeddings . . . 47
5.2. Convex ω-categorical structures . . . 50
5.3. Convex numerical structures . . . 52
5.4. Ages defined by forbidden substructures . . . 54
5.5. Ages defined by forbidden homomorphic images . . . 56
5.6. (Non-)closure properties of convexity . . . 59
6. Towards user-definable concrete domains . . . 61
6.1. A proof-theoretic perspective . . . 65
6.2. Universal Horn sentences and the JEP . . . 66
6.3. Universal sentences and the AP: the Horn case . . . 77
6.4. Universal sentences and the AP: the general case . . . 90
7. Conclusion . . . 99
7.1. Contributions and future outlook . . . 99
A. Concrete Domains without Equality . . . 103
Bibliography . . . 107
List of figures . . . 115
Alphabetical Index . . . 11
Homogeneity and Homogenizability: Hard Problems for the Logic SNP
We show that the question whether a given SNP sentence defines a
homogenizable class of finite structures is undecidable, even if the sentence
comes from the connected Datalog fragment and uses at most binary relation
symbols. As a byproduct of our proof, we also get the undecidability of some
other properties for Datalog programs, e.g., whether they can be rewritten in
MMSNP, whether they solve some finite-domain CSP, or whether they define the
age of a reduct of a homogeneous Ramsey structure in a finite relational
signature. We subsequently show that the closely related problem of testing the
amalgamation property for finitely bounded classes is EXPSPACE-hard or
PSPACE-hard, depending on whether the input is specified by a universal
sentence or a set of forbidden substructures.Comment: 34 pages, 3 figure
Using model theory to find w-admissible concrete domains
Concrete domains have been introduced in the area of Description Logic to enable reference to concrete objects (such as numbers) and predefined predicates on these objects (such as numerical comparisons) when defining concepts. Unfortunately, in the presence of general concept inclusions (GCIs), which are supported by all modern DL systems, adding concrete domains may easily lead to undecidability. One contribution of this paper is to strengthen the existing undecidability results further by showing that concrete domains even weaker than the ones considered in the previous proofs may cause undecidability. To regain decidability in the presence of GCIs, quite strong restrictions, in sum called w-admissiblity, need to be imposed on the concrete domain. On the one hand, we generalize the notion of w-admissiblity from concrete domains with only binary predicates to concrete domains with predicates of arbitrary arity. On the other hand, we relate w-admissiblity to well-known notions from model theory. In particular, we show that finitely bounded, homogeneous structures yield w-admissible concrete domains. This allows us to show w-admissibility of concrete domains using existing results from model theory
On the Descriptive Complexity of Temporal Constraint Satisfaction Problems
Finite-domain constraint satisfaction problems are either solvable by
Datalog, or not even expressible in fixed-point logic with counting. The border
between the two regimes coincides with an important dichotomy in universal
algebra; in particular, the border can be described by a strong height-one
Maltsev condition. For infinite-domain CSPs, the situation is more complicated
even if the template structure of the CSP is model-theoretically tame. We prove
that there is no Maltsev condition that characterizes Datalog already for the
CSPs of first-order reducts of (Q;<); such CSPs are called temporal CSPs and
are of fundamental importance in infinite-domain constraint satisfaction. Our
main result is a complete classification of temporal CSPs that can be expressed
in one of the following logical formalisms: Datalog, fixed-point logic (with or
without counting), or fixed-point logic with the Boolean rank operator. The
classification shows that many of the equivalent conditions in the finite fail
to capture expressibility in Datalog or fixed-point logic already for temporal
CSPs.Comment: 57 page
An Algebraic View on p-Admissible Concrete Domains for Lightweight Description Logics: Extended Version
Concrete domains have been introduced in Description Logics (DLs) to enable reference to concrete objects (such as numbers) and predefined predicates on these objects (such as numerical comparisons) when defining concepts. To retain decidability when integrating a concrete domain into a decidable DL, the domain must satisfy quite strong restrictions. In previous work, we have analyzed the most prominent such condition, called w-admissibility, from an algebraic point of view. This provided us with useful algebraic tools for proving w-admissibility, which allowed us to find new examples for concrete domains whose integration leaves the prototypical expressive DL ALC decidable. When integrating concrete domains into lightweight DLs of the EL family, achieving decidability is not enough. One wants reasoning in the resulting DL to be tractable. This can be achieved by using so-called p-admissible concrete domains and restricting the interaction between the DL and the concrete domain. In the present paper, we investigate p-admissibility from an algebraic point of view. Again, this yields strong algebraic tools for demonstrating p-admissibility. In particular, we obtain an expressive numerical padmissible concrete domain based on the rational numbers. Although w-admissibility and p-admissibility are orthogonal conditions that are almost exclusive, our algebraic characterizations of these two properties allow us to locate an infinite class of p-admissible concrete domains whose integration into ALC yields decidable DLs
Universal Horn Sentences and the Joint Embedding Property
The finite models of a universal sentence in a finite relational
signature are the age of a structure if and only if has the joint
embedding property. We prove that the computational problem whether a given
universal sentence has the joint embedding property is undecidable, even
if is additionally Horn and the signature of only contains
relation symbols of arity at most two.Comment: 16 page
Antioxidant content in dried fruit
Bakalářská práce je zaměřena na studium a stanovení antioxidační kapacity a celkového obsahu fenolických látek v sušeném ovoci (banán, ananas, kiwi, mango, pitahaya) a porovnání obsahu těchto látek v běžně sušeném ovoci vs. v ovoci lyofilizovaném. Fenolické látky byly stanoveny spektrofotometricky pomocí Folin-Ciocalteuho činidla. Antioxidační kapacita byla stanovena rovněž spektrofotometricky metodou DPPH. Výsledky obou stanovení byly statisticky zpracovány. Obsah fenolických látek i antioxidační kapacita u lyofilizovaných vzorků byly většinou výrazně vyšší.This bachelor's thesis is focused on studying and determining the antioxidant capacity and the total amount of phenolic compounds in dried fruit (banana, pineapple, kiwi, mango, dragon fruit) and comparing the amount of these in oven dried vs. freeze dried samples. The total phenolic content was determined spectrophotometrically using the Folin-Ciocalteu reagent. The antioxidant capacity was also determined spectrophotometrically using the DPPH method. The results of both determinations was statistically processed. Both the total phenolic content and antioxidant capacity of freeze dried samples in most cases were significantly higher.Fakulta chemicko-technologickáStudent seznámil členy zkušební komise s obsahem své bakalářské práce, poté byl seznámen s posudkem vedoucího bakalářské práce. Student odpověděl na otázky členů zkušební komise.Dokončená práce s úspěšnou obhajobo
Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains
Concrete domains have been introduced in the area of Description Logic (DL) to enable reference to concrete objects (such as numbers) and predefined predicates on these objects (such as numerical comparisons) when defining concepts. Unfortunately, in the presence of general concept inclusions (GCIs), which are supported by all modern DL systems, adding concrete domains may easily lead to undecidability.
To regain decidability of the DL ALC in the presence of GCIs, quite strong restrictions, called ω-admissibility, were imposed on the concrete domain. On the one hand, we generalize the notion of ω-admissibility from concrete domains with only binary predicates to concrete domains with predicates of arbitrary arity. On the other hand, we relate ω-admissibility to well-known notions from model theory. In particular, we show that finitely bounded homogeneous structures yield ω-admissible concrete domains. This allows us to show ω-admissibility of concrete domains using existing results from model theory.
When integrating concrete domains into lightweight DLs of the EL family, achieving decidability of reasoning is not enough. One wants the resulting DL to be tractable. This can be achieved by using so-called p-admissible concrete domains and restricting the interaction between the DL and the concrete domain. We investigate p-admissibility from an algebraic point of view. Again, this yields strong algebraic tools for demonstrating p-admissibility. In particular, we obtain an expressive numerical p-admissible concrete domain based on the rational numbers. Although ω-admissibility and p-admissibility are orthogonal conditions that are almost exclusive, our algebraic characterizations of these two properties allow us to locate an infinite class of p-admissible concrete domains whose integration into ALC yields
decidable DLs.
DL systems that can handle concrete domains allow their users to employ a fixed set of predicates of one or more fixed concrete domains when modelling concepts.
They do not provide their users with means for defining new predicates, let alone new concrete domains. The good news is that finitely bounded homogeneous structures offer precisely that. We show that integrating concrete domains based on finitely bounded homogeneous structures into ALC yields decidable DLs even if we allow predicates specified by first-order formulas. This class of structures also provides effective means for defining new ω-admissible concrete domains with at most binary predicates. The bad news is that defining ω-admissible concrete domains with predicates of higher arities is computationally hard. We obtain two new lower bounds for this meta-problem, but leave its decidability open. In contrast, we prove that there is no algorithm that would facilitate defining p-admissible concrete domains already for binary signatures.:1. Introduction . . . 1
2. Preliminaries . . . 5
3. Description Logics with Concrete Domains . . . 9
3.1. Basic definitions and undecidability results . . . 9
3.2. Decidable and tractable DLs with concrete domains . . . 16
4. A Model-Theoretic Analysis of ω-Admissibility . . . 23
4.1. Homomorphism ω-compactness via ω-categoricity . . . 23
4.2. Patchworks via homogeneity . . . 24
4.3. JDJEPD via decomposition into orbits . . . 27
4.4. Upper bounds via finite boundedness . . . 28
4.5. ω-admissible finitely bounded homogeneous structures . . . 32
4.6. ω-admissible homogeneous cores with a decidable CSP . . . 34
4.7. Coverage of the developed sufficient conditions . . . 36
4.8. Closure properties: homogeneity & finite boundedness . . . 39
5. A Model-Theoretic Analysis of p-Admissibility . . . 47
5.1. Convexity via square embeddings . . . 47
5.2. Convex ω-categorical structures . . . 50
5.3. Convex numerical structures . . . 52
5.4. Ages defined by forbidden substructures . . . 54
5.5. Ages defined by forbidden homomorphic images . . . 56
5.6. (Non-)closure properties of convexity . . . 59
6. Towards user-definable concrete domains . . . 61
6.1. A proof-theoretic perspective . . . 65
6.2. Universal Horn sentences and the JEP . . . 66
6.3. Universal sentences and the AP: the Horn case . . . 77
6.4. Universal sentences and the AP: the general case . . . 90
7. Conclusion . . . 99
7.1. Contributions and future outlook . . . 99
A. Concrete Domains without Equality . . . 103
Bibliography . . . 107
List of figures . . . 115
Alphabetical Index . . . 11
Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains
Concrete domains have been introduced in the area of Description Logic (DL) to enable reference to concrete objects (such as numbers) and predefined predicates on these objects (such as numerical comparisons) when defining concepts. Unfortunately, in the presence of general concept inclusions (GCIs), which are supported by all modern DL systems, adding concrete domains may easily lead to undecidability.
To regain decidability of the DL ALC in the presence of GCIs, quite strong restrictions, called ω-admissibility, were imposed on the concrete domain. On the one hand, we generalize the notion of ω-admissibility from concrete domains with only binary predicates to concrete domains with predicates of arbitrary arity. On the other hand, we relate ω-admissibility to well-known notions from model theory. In particular, we show that finitely bounded homogeneous structures yield ω-admissible concrete domains. This allows us to show ω-admissibility of concrete domains using existing results from model theory.
When integrating concrete domains into lightweight DLs of the EL family, achieving decidability of reasoning is not enough. One wants the resulting DL to be tractable. This can be achieved by using so-called p-admissible concrete domains and restricting the interaction between the DL and the concrete domain. We investigate p-admissibility from an algebraic point of view. Again, this yields strong algebraic tools for demonstrating p-admissibility. In particular, we obtain an expressive numerical p-admissible concrete domain based on the rational numbers. Although ω-admissibility and p-admissibility are orthogonal conditions that are almost exclusive, our algebraic characterizations of these two properties allow us to locate an infinite class of p-admissible concrete domains whose integration into ALC yields
decidable DLs.
DL systems that can handle concrete domains allow their users to employ a fixed set of predicates of one or more fixed concrete domains when modelling concepts.
They do not provide their users with means for defining new predicates, let alone new concrete domains. The good news is that finitely bounded homogeneous structures offer precisely that. We show that integrating concrete domains based on finitely bounded homogeneous structures into ALC yields decidable DLs even if we allow predicates specified by first-order formulas. This class of structures also provides effective means for defining new ω-admissible concrete domains with at most binary predicates. The bad news is that defining ω-admissible concrete domains with predicates of higher arities is computationally hard. We obtain two new lower bounds for this meta-problem, but leave its decidability open. In contrast, we prove that there is no algorithm that would facilitate defining p-admissible concrete domains already for binary signatures.:1. Introduction . . . 1
2. Preliminaries . . . 5
3. Description Logics with Concrete Domains . . . 9
3.1. Basic definitions and undecidability results . . . 9
3.2. Decidable and tractable DLs with concrete domains . . . 16
4. A Model-Theoretic Analysis of ω-Admissibility . . . 23
4.1. Homomorphism ω-compactness via ω-categoricity . . . 23
4.2. Patchworks via homogeneity . . . 24
4.3. JDJEPD via decomposition into orbits . . . 27
4.4. Upper bounds via finite boundedness . . . 28
4.5. ω-admissible finitely bounded homogeneous structures . . . 32
4.6. ω-admissible homogeneous cores with a decidable CSP . . . 34
4.7. Coverage of the developed sufficient conditions . . . 36
4.8. Closure properties: homogeneity & finite boundedness . . . 39
5. A Model-Theoretic Analysis of p-Admissibility . . . 47
5.1. Convexity via square embeddings . . . 47
5.2. Convex ω-categorical structures . . . 50
5.3. Convex numerical structures . . . 52
5.4. Ages defined by forbidden substructures . . . 54
5.5. Ages defined by forbidden homomorphic images . . . 56
5.6. (Non-)closure properties of convexity . . . 59
6. Towards user-definable concrete domains . . . 61
6.1. A proof-theoretic perspective . . . 65
6.2. Universal Horn sentences and the JEP . . . 66
6.3. Universal sentences and the AP: the Horn case . . . 77
6.4. Universal sentences and the AP: the general case . . . 90
7. Conclusion . . . 99
7.1. Contributions and future outlook . . . 99
A. Concrete Domains without Equality . . . 103
Bibliography . . . 107
List of figures . . . 115
Alphabetical Index . . . 11
Using Digital Media in the Marketing Strategy of a Distributor Outdoor Company
Bakalářská práce se zabývá oblastí digitálního marketingu a jeho využitím v outdoorové firmě. Práce je rozdělena na čtyři části. První část se věnuje definování vymezujících pojmů, mezi než patří marketing, internetový marketing a internet. Zmíněna jsou také charakteristika a vývoj Internetu, rozdíly mezi daty a informacemi, popis fungování tohoto média a jeho uplatnění v oblasti marketingu včetně kladů a záporů využití Internetového marketingu. V první části práce je rovněž obsaženo porovnání marketingu B2B a B2C. Oba trhy jsou zde charakterizovány vzhledem k jejich marketingovému uplatnění. Ve druhé kapitole se práce zajímá o konkrétní online marketingové nástroje, přičemž je věnována pozornost především pojmům reklama, online public relations, přímý marketing a podpora prodeje. Všechny tyto části jsou zde detailně popsány a charakterizovány. Teoretická část práce se zabývá vyhodnocením jednotlivých kampaní, na jejichž realizaci se autor práce podílel. Na základě výsledků těchto kampaní jsou následně navržena doporučení pro další marketingový vývoj společnosti.The bachelor thesis deals with the area of digital marketing and its use in an outdoor company. The thesis is divided into four parts. The first part deals with defining terms such as marketing, internet marketing and the Internet. It also mentions the characteristics and development of the Internet, the differences between data and information, a description how it is functioning and its application in marketing, including the pros and cons of Internet marketing. The first part also contains a comparison of B2B and B2C marketing. Both markets are characterized by their marketing experience. In the second chapter, the work is concerned with specific online marketing tools, paying particular attention to the concepts of advertising, online public relations, direct marketing and sales promotion. All these parts are described and characterized in detail here. The theoretical part deals with the evaluation of the individual campaigns, the realization of which the author of the work participated. Based on the results of these campaigns, recommendations for further marketing development are proposed